Fair Triangulations
نویسنده
چکیده
We describe the statistics of checkerboard triangulations obtained by colouring black every other triangle in triangulations of convex polygons.1
منابع مشابه
Polynomial Surfaces Interpolating Arbitrary Triangulations
Triangular Bézier patches are an important tool for defining smooth surfaces over arbitrary triangular meshes. The previously introduced 4-split method interpolates the vertices of a 2-manifold triangle mesh by a set of tangent plane continuous triangular Bézier patches of degree five. The resulting surface has an explicit closed form representation and is defined locally. In this paper, we int...
متن کاملLayered - Triangulations of 3 – Manifolds
A family of one-vertex triangulations of the genus-g-handlebody, called layered-triangulations, is defined. These triangulations induce a one-vertex triangulation on the boundary of the handlebody, a genus g surface. Conversely, any one-vertex triangulation of a genus g surface can be placed on the boundary of the genus-g-handlebody in infinitely many distinct ways; it is shown that any of thes...
متن کاملLectures on Discrete and Polyhedral Geometry
1. The Helly theorem 11 2. Carathéodory and Bárány theorems 20 3. The Borsuk conjecture 26 4. Fair division 32 5. Inscribed and circumscribed polygons 39 6. Dyson and Kakutani theorems 54 7. Geometric inequalities 61 8. Combinatorics of convex polytopes 72 9. Center of mass, billiards and the variational principle 83 10. Geodesics and quasi-geodesics 96 11. The Steinitz theorem and its extensio...
متن کاملGeometric triangulations and discrete Laplacians on manifolds
2 Euclidean structures 3 2.1 Basic definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Weighted triangulations . . . . . . . . . . . . . . . . . . . . . . . 4 2.3 Thurston triangulations . . . . . . . . . . . . . . . . . . . . . . . 5 2.4 Duality triangulations . . . . . . . . . . . . . . . . . . . . . . . . 6 2.5 Equivalence of metric triangulations . . . . . . . . . . . . ...
متن کاملGenerating All Triangulations of Plane Graphs
In this paper, we deal with the problem of generating all triangulations of plane graphs. We give an algorithm for generating all triangulations of a triconnected plane graph G of n vertices. Our algorithm establishes a tree structure among the triangulations of G, called the “tree of triangulations,” and generates each triangulation of G in O(1) time. The algorithm uses O(n) space and generate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008